Automated theorem proving - PDFSEARCH.IO - Document Search Engine

Automated theorem proving
Results: 768

#	Item
341	Higher-Order Dynamic Pattern Unification for Dependent Types and Records Andreas Abel1 and Brigitte Pientka2 1 Institut f¨ Add to Reading List Source URL: www2.tcs.ifi.lmu.de Language: English - Date: 2011-02-03 11:01:19 Automated theorem proving Logic programming Logical truth Propositional calculus Substitution Function Model theory Linear temporal logic Μ operator Logic Mathematics Mathematical logic
342	Productive use of failure in formal methods Yuhui Lin, Gudmund Grov & Alan Bundy ARW Glasgow, 11 April 2011 Add to Reading List Source URL: www.ai4fm.org Language: English - Date: 2013-10-30 13:20:44 Theoretical computer science Rippling Mathematical proof Proof Automated theorem proving Mathematics Logic
343	An Ordered Theory Resolution Calculus Peter Baumgartner Presenter: Xing Tan with contributions by Scott Sanner Department of Mechanical and Industrial Engineering Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2006-04-12 01:59:47 Mathematics Predicate logic Literal Propositional calculus Predicate variable Unification Resolution Calculus Universal quantification Logic Automated theorem proving Mathematical logic
344	Intro AI4FM project Models of “why” Add to Reading List Source URL: www.ai4fm.org Language: English - Date: 2013-10-30 13:20:44 Mathematical proof Knowledge Rippling Formal methods Logic Automated theorem proving Mathematics Mathematical logic
345	Generating Counterexamples for Structural Inductions by Exploiting Nonstandard Models Jasmin Christian Blanchette1? and Koen Claessen2 2 1 Institut für Informatik, Technische Universität München, Germany Add to Reading List Source URL: www21.in.tum.de Language: English - Date: 2010-10-25 11:45:35 Mathematical proofs Inductive reasoning Mathematical induction Graph theory Structural induction Constructible universe First-order logic Automated theorem proving Mathematics Logic Mathematical logic
346	Enhancing Davis Putnam with Extended Binary Clause Reasoning Fahiem Bacchus Dept. Of Computer Science University Of Toronto Toronto, Ontario Canada, M5S 1A4 Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2002-04-08 12:32:58 Mathematical logic Constraint programming Formal methods Logic in computer science Boolean algebra Boolean satisfiability problem Unit propagation Resolution Davis–Putnam algorithm Theoretical computer science Mathematics Automated theorem proving
347	The Ackermann Award 2005 Erich Gr¨ adel, Janos Makowsky, and Alexander Razborov Members of EACSL Jury for the Ackermann Award The Ackermann Award Add to Reading List Source URL: eacsl.kahle.ch Language: English - Date: 2013-12-08 17:58:16 Automated theorem proving Computability theory Theory of computation Computational complexity theory Logic in computer science Alexander Razborov Wilhelm Ackermann Decidability First-order logic Theoretical computer science Mathematics Logic
348	Nitpick: A Counterexample Generator for Isabelle/HOL Based on the Relational Model Finder Kodkod (System Description)∗ Jasmin Christian Blanchette Technische Universität München Garching, Germany Add to Reading List Source URL: www21.in.tum.de Language: English - Date: 2010-10-25 11:45:35 Mathematical logic Model theory Formal languages Formal methods Logical syntax Structure Isabelle Logic programming Automated theorem proving Mathematics Logic Metalogic
349	J. Autom. Reasoning manuscript No. (will be inserted by the editor) Semi-intelligible Isar Proofs from Machine-Generated Proofs Jasmin Christian Blanchette · Sascha Böhme · Mathias Fleury · Steffen Juilf Smolka · Add to Reading List Source URL: www21.in.tum.de Language: English - Date: 2015-01-25 16:18:54 Automated theorem proving Proof theory Mathematical proofs Logical syntax First-order logic Proof assistant Theorem Isabelle Natural deduction Logic Mathematics Mathematical logic
350	A Decision Procedure for (Co)datatypes in SMT Solvers Andrew Reynolds1 and Jasmin Christian Blanchette2,3 1 École Polytechnique Fédérale de Lausanne (EPFL), Switzerland 2 Inria Nancy & LORIA, Villers-lès-Nancy, Franc Add to Reading List Source URL: www21.in.tum.de Language: English - Date: 2015-03-12 19:07:51 Mathematics Automated theorem proving Logic programming Unification Curry–Howard correspondence First-order logic Interpretation Heat equation SKI combinator calculus Mathematical logic Logic Model theory

UPDATE